Möbius-deBruijn: The product of Möbius cube and deBruijn digraph

نویسندگان

  • Deke Guo
  • Guiming Zhu
  • Hai Jin
  • Panlong Yang
  • Yingwen Chen
  • Xianqing Yi
  • Junxian Liu
چکیده

a National Key Laboratory for Information System Engineering, College of Information System and Management, National University of Defense Technology, Changsha, Hunan 410073, China b National MOE Key Laboratory for Services Computing Technology and System, College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, Hubei 430074, China c Research Center of Military Computation Experiment and Parallel System Technology, National University of Defense Technology, Changsha, Hunan 410073, China d Jiangnan Institute of Computing Technology, Wuxi 214083, China e Institute of Communication Engineering, P.L.A. University of Science and Technology, PO Box 110, Nanjing, Jiangsu, China f College of Computer, National University of Defense Technology, Changsha, Hunan 410073, China

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparative Study of Product Networks

The Cartesian product of interconnection networks has been investigated recently as a method for combining desirable properties of component networks. This paper presents a unified framework for obtaining and comparing properties of a virtually unlimited number of product networks. This work complements results appeared in the literature for product networks and conducts a comparative study bet...

متن کامل

Wormhole Routing in De Bruijn Networks and Hyper-debruijn

The order-(m,n) hyper-deBruijn graph H D ( m , n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally imponant subgraphs and admit efficient implemen...

متن کامل

Wormhole routing in de Bruijn networks and hyper-de Bruijn networks

The order-(m, n) hyper-deBruijn graph HD(m,n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally important subgraphs and admit efficient implementat...

متن کامل

The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network

We prove the following results : (a) The Cube-Connected Cycles network of dimension n is a subgraph of the Butterry network of dimension n. (b) The Shuue-Exchange network of dimension n is a subgraph of the DeBruijn network of dimension n.

متن کامل

Embedding a family of 2D meshes into Möbius cubes

Abstract: Möbius cubes are an important class of hypercube variants. This paper addresses how to embed a family of disjoint 2D meshes into a Möbius cube. Two major contributions of this paper are: (1) For n ≥ 1, there exists a 2 × 2 mesh that can be embedded in the n-dimensional Möbius cube with dilation 1 and expansion 1. (2) For n ≥ 4, there are two disjoint 4 × 2 meshes that can be embedded ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 112  شماره 

صفحات  -

تاریخ انتشار 2012